Fluid Flow Models and Queues— A Connection by Stochastic Coupling
نویسندگان
چکیده
We establish in a direct manner that the steady state distribution of Markovian fluid flow models can be obtained from a quasi birth and death queue. This is accomplished through the construction of the processes on a common probability space and the demonstration of a distributional coupling relation between them. The results here provide an interpretation for the quasi-birth-and-death processes in the matrix-geometric approach of Ramaswami and subsequent results based on them obtained by Soares and Latouche.
منابع مشابه
Linear Stochastic Fluid Networks
We introduce open stochastic fluid networks that can be regarded as continuous analogs or fluid limits of open networks of infinite-server queues. Random exogenous input may come to any of the queues. At each queue, a cdf-valued stochastic process governs the proportion of the input processed by a given time after arrival. The routing may be deterministic (a specified sequence of successive que...
متن کاملFluid Queues Driven by a Discouraged Arrivals Queue
We consider a fluid queue driven by a discouraged arrivals queue and obtain explicit expressions for the stationary distribution function of the buffer content in terms of confluent hypergeometric functions. We compare it with a fluid queue driven by an infinite server queue. Numerical results are presented to compare the behaviour of the buffer content distributions for both these models. 1. I...
متن کاملبکارگیری مدل های مختلف کوپل شدگی سیال - جسم برای بررسی مشخصه های ارتعاشی در ناحیه قفل شدگی
In this paper, several models of structure-fluid coupling are employed to investigate on the vibration behavior of the structure. Using basic equations of vibration and employing a mathematical model, a single degree of freedom system is analyzed. Some parameters of the mathematical model are obtained from test. To examine structure-flow interaction, coupled system of nonlinear second-order dif...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملThe Impact of Delay Announcements in Many-Server Queues with Abandonment
This paper studies the performance impact of making delay announcements to arriving customers who must wait before starting service in a many-server queue with customer abandonment. The queue is assumed to be invisible to waiting customers, as in most customer contact centers, when contact is made by telephone, email or instant messaging. Customers who must wait are told upon arrival either the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003